K-scaffold subgraphs of complex networks
نویسندگان
چکیده
منابع مشابه
Identification of functional information subgraphs in complex networks.
We present a general information theoretic approach for identifying functional subgraphs in complex networks. We show that the uncertainty in a variable can be written as a sum of information quantities, where each term is generated by successively conditioning mutual informations on new measured variables in a way analogous to a discrete differential calculus. The analogy to a Taylor series su...
متن کاملInhomogeneous evolution of subgraphs and cycles in complex networks.
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains unchanged, while the density of others increase at a rate that is determined by the network's degree distribution and clustering properties. This inhomogeneous...
متن کاملNonlinear Diffusion Through Large Complex Networks Containing Regular Subgraphs
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either the well-structured regular subgraphs or those ample with triangles. We observe a superdiffusion for the highly connected nodes while it is Brownian (∝ t, d is the intrinsic space dimension of regular subgraphs) for the rest of nodes. Transport within a supernode is affected by the finite si...
متن کاملFinding Connected Dense k -Subgraphs
Given a connected graph G on n vertices and a positive integer k ≤ n, a subgraph of G on k vertices is called a k-subgraph in G. We design combinatorial approximation algorithms for finding a connected ksubgraph in G such that its density is at least a factor Ω(max{n, k/n}) of the density of the densest k-subgraph in G (which is not necessarily connected). These particularly provide the first n...
متن کاملMaximum k -regular induced subgraphs
Independent sets, induced matchings and cliques are examples of regular induced subgraphs in a graph. In this paper, we prove that finding a maximum cardinality k-regular induced subgraph is an NP-hard problem for any value of k. We propose a convex quadratic upper bound on the size of a k-regular induced subgraph and characterize those graphs for which this bound is attained. Finally, we exten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Europhysics Letters (EPL)
سال: 2007
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/77/18004